全文获取类型
收费全文 | 233篇 |
免费 | 79篇 |
国内免费 | 6篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 9篇 |
2019年 | 3篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 13篇 |
2014年 | 17篇 |
2013年 | 16篇 |
2012年 | 18篇 |
2011年 | 22篇 |
2010年 | 14篇 |
2009年 | 22篇 |
2008年 | 11篇 |
2007年 | 13篇 |
2006年 | 24篇 |
2005年 | 25篇 |
2004年 | 20篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 12篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有318条查询结果,搜索用时 15 毫秒
61.
设计了一种蠕动式微小管道机器人,采用三组直流电机与螺旋传动装置,通过控制三组电机顺序协调动作,实现了机器人的蠕动前进。研究了机器人在竖直管道中驱动负载的情况,以及爪子适应管径变化的力学调节特征。利用ADAMS动力学分析软件,对机构做了运动学和动力学仿真,通过仿真得到了牵引力和移动速度与结构参数之间的关系。仿真表明,机器人可以适应15~20mm的管道,驱动力达到28N,移动速度为6mm/s。 相似文献
62.
卫星数传调度问题是一个具有多时间窗口、多资源约束的优化问题。针对该问题,建立了卫星数传需求模型、任务模型和调度模型。在建模过程中,采用了框架模型形式,把问题中的主要约束封闭于每个数传任务中,这在降低调度模型复杂度的同时,也降低了调度算法设计难度。还提出了调度算法设计思想,并设计了一基于灵活度的调度算法。仿真表明,所建立的模型及算法对解决卫星数传调度问题是可行的。 相似文献
63.
Tetsuji Hirayama 《海军后勤学研究》2003,50(7):719-741
In this paper, we investigate multiclass feedback queues with gated disciplines. The server selects the stations by a nonpreemptive priority scheduling algorithm and serves customers in the selected station by either a gated FCFS discipline or a gated priority discipline. We take a rather systematic approach to their mean sojourn times. We define conditional expected sojourn times for all customers and derive their expressions from an analysis of busy periods. Since they are shown to be linear in some components of the system states, their steady state mean values can be derived from simple limiting procedures. These mean values can be obtained from a set of linear equations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 719–741, 2003. 相似文献
64.
We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016 相似文献
65.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
66.
Philip Kaminsky 《海军后勤学研究》2003,50(3):257-272
In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
67.
在资源受限项目调度问题中,将可再生资源进一步拓展为具有能力差异的柔性资源,建立考虑能力差异的柔性资源受限的多模式项目调度问题模型,该模型是对传统资源约束项目调度问题(RCPSP)更接近实际的拓展。提出了基于粒子群算法的求解算法,粒子群算法求解该模型的思路为,利用蒙特卡洛方法根据资源-能力矩阵与活动模式-能力矩阵得到活动模式-资源矩阵,将考虑能力差异的柔性资源受限的多模式项目调度问题转换为常规的多模式项目调度问题,然后利用基于任务序列与模式表示的粒子群算法对该多模式项目调度问题进行求解。用数值实例说明了模型的合理性与算法的有效性。 相似文献
68.
In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017 相似文献
69.
70.
基于散体极限平衡条件,利用马斯顿提出的沟内埋管垂直土压力计算模型,对存在冲击荷载情况的埋地管道受力进行分析,同时根据弹性半空间理论对落石冲击荷载情况下管道轴向附加荷载分布情况进行了计算分析。在利用传统的应力设计进行分析校核的同时,应用竖向变形量设计理念,研究了落石垂直冲击管道正上方时管道变形情况,以此来判断管道失效与否,为地质崩塌灾害易发区埋地管道的铺设方式提供理论和实践依据。 相似文献